Euclidean algorithm - PDFSEARCH.IO - Document Search Engine

Euclidean algorithm
Results: 423

#	Item
161	Verifiable Encryption of Digital Signatures and Applications GIUSEPPE ATENIESE The Johns Hopkins University This paper presents a new simple schemes for verifiable encryption of digital signatures. We make Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2004-05-21 14:56:23 Digital signature Rabin signature algorithm RSA Diffie–Hellman key exchange ElGamal encryption Schnorr signature Euclidean algorithm Naccache–Stern cryptosystem ElGamal signature scheme Cryptography Public-key cryptography XTR
162	2013 Australian Intermediate Mathematics Olympiad Time allowed: 4 hours. NO calculators are to be used. Add to Reading List Source URL: www.amt.edu.au Language: English - Date: 2014-08-28 00:49:12 Polynomials Elementary algebra Equations Curves Parabola Area Euclidean algorithm Proofs involving the Moore–Penrose pseudoinverse Mathematics Algebra Geometry
163	Count-Min Sketch Graham Cormode AT&T Labs–Research, [removed] SYNONYMS CM Sketch Add to Reading List Source URL: dimacs.rutgers.edu Language: English - Date: 2009-12-03 19:57:13 Linear algebra Count-Min sketch Hashing Sketch Search algorithms Euclidean vector Vector space Hash function Streaming algorithm Algebra Mathematics Abstract algebra
164	Homework Two, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-12 01:34:34 Integer factorization algorithms Euclidean algorithm Multiplication Computational complexity theory Algorithm Time complexity Multiplication algorithm Greatest common divisor Quadratic sieve Mathematics Computational number theory Theoretical computer science
165	ADFS::HardDisc4.$.UKMT.JOS.imok.booklets.2015.PoScript Add to Reading List Source URL: www.ukmt.org.uk Language: English - Date: 2015-03-31 05:46:20 Number theory Coprime Algebraic number theory Prime number Factorization Number Ring Euclidean algorithm Quadratic sieve Mathematics Abstract algebra Integer sequences
166	ALGORITHMS TO TEST RAY-TRIANGLE INTERSECTION. COMPARATIVE STUDY Rafael J. Segura1, Francisco R. Feito Departamento de Informática Universidad de Jaén Escuela Politécnica Superior Add to Reading List Source URL: wscg.zcu.cz Language: English - Date: 2001-01-02 05:44:18 Euclidean geometry Triangles Triangle Algorithm Golden ratio Ray tracing Delaunay triangulation Geometry Mathematics Triangle geometry
167	CONTINUOUS AMORTIZATION: A NON-PROBABILISTIC ADAPTIVE ANALYSIS TECHNIQUE∗ MICHAEL BURR† , FELIX KRAHMER‡ , AND CHEE YAP† Abstract. Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2010-03-04 18:56:27 Integral calculus Integral Antiderivative Linear programming Function Euclidean algorithm Multiple integral Mathematics Mathematical analysis Functions and mappings
168	Solutions to Homework Two CSE[removed]A 1000-bit number lies between 2999 and 21000 − 1; thus its length in decimal is roughly log10 21000 = 1000 log10 2 ≈ 300. Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-12 01:34:36 Arithmetic Elementary arithmetic Least common multiple Recursion Fibonacci number Euclidean algorithm Greatest common divisor Mathematics Number theory Integer factorization algorithms
169	Fast methods to compute the Riemann zeta function Ghaith Ayesh Hiary April 21, 2008 Abstract The Riemann zeta function on the critical line can be computed using Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 2012-08-16 12:29:05 Riemann hypothesis Riemann zeta function Time complexity Fast Fourier transform Number theory Dirichlet series Bernoulli number Euclidean algorithm Mathematical analysis Mathematics Analytic number theory
170	Solutions to Homework Four CSE[removed]Algorithm A has running time TA (n) = 5TA (n/2) + O(n), Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-10-31 00:07:52 Sorting algorithms Euclidean algorithm Analysis of algorithms Computational complexity theory Quicksort Time complexity Binary search algorithm Binary logarithm Greatest common divisor Mathematics Theoretical computer science Applied mathematics

UPDATE